A Τ-tilting Approach to Dissections of Polygons
نویسنده
چکیده
We show that any accordion complex associated to a dissection of a convex polygon is isomorphic to the support τ -tilting simplicial complex of an explicit finite dimensional algebra. To this end, we prove a property of some induced subcomplexes of support τ -tilting simplicial complexes of finite dimensional algebras.
منابع مشابه
AN INTRODUCTION TO HIGHER CLUSTER CATEGORIES
In this survey, we give an overview over some aspects of the set of tilting objects in an $m-$cluster category, with focus on those properties which are valid for all $m geq 1$. We focus on the following three combinatorial aspects: modeling the set of tilting objects using arcs in certain polygons, the generalized assicahedra of Fomin and Reading, and colored quiver mutation.
متن کاملIntermediate Co-t-structures, Two-term Silting Objects, Τ-tilting Modules, and Torsion Classes
If (A,B) and (A′,B′) are co-t-structures of a triangulated category, then (A′,B′) is called intermediate if A ⊆ A′ ⊆ ΣA. Our main results show that intermediate co-t-structures are in bijection with two-term silting subcategories, and also with support τ -tilting subcategories under some assumptions. We also show that support τ -tilting subcategories are in bijection with certain finitely gener...
متن کاملIntroduction to τ-tilting theory.
From the viewpoint of mutation, we will give a brief survey of tilting theory and cluster-tilting theory together with a motivation from cluster algebras. Then we will give an introduction to τ-tilting theory which was recently developed.
متن کاملMy Parade of Algorithmic Mathematical Art
Animations are discussed for a range of geometric dissections. These include a variety of twist-hinged dissections, some swing-hinged dissections, dissections of squares and cubes corresponding to a certain integer identities, folding dissections of multi-level regular polygons, and folding dissections of multi-level polyominoes. Artistic issues pertaining to these dissections and animations ar...
متن کاملDissections of Polygons into Convex Polygons
In the paper we present purely combinatorial conditions that allow us to recognize the topological equivalence (or non-equivalence) of two given dissections. Using a computer program based on this result, we are able to generate a set which contains all topologically non-equivalent dissections of a p0-gon into convex pi-gons, i = 1, ..., n, where n, p0, ..., pn are integers such that n ≥ 2, pi ...
متن کامل